From Infinite to Finite Belief Contraction
نویسندگان
چکیده
This article contributes to the ongoing discussion on multiple belief change. Based on earlier work, we devise a new condition, called (K−̇F), that reduces infinite contraction to sentence contraction. Two representation results reported herein characterize (K−̇F) in terms of two well known constructive models for set contraction; namely the partial meet model and the comparative possibility model (a generalization of the epistemic entrenchment model).
منابع مشابه
Three Approaches to Finitude in Belief Change
Since neither a human mind nor a computer can deal directly with infinite structures, well-behaved models of belief change should operate exclusively on belief states that have a finite representation. Three ways to achieve this without resorting to a finite language are investigated: belief bases, specified meet contraction, and focused propositional extenders. Close connections are shown to h...
متن کاملA Finite Base Belief Revision System
Theories of dynamic reasoning invariably are more elegant on paper than they are in an implementation. A major criticism of the AGM belief revision logic [Gärdenfors 1988] is that it relies on calculations using infinite belief sets to satisfy its postulates for rational belief revision. This has stopped it from being used in any practical systems for reasoning. [Williams 1993] proposes a theor...
متن کاملDL-Lite Contraction and Revision
Two essential tasks in managing description logic knowledge bases are eliminating problematic axioms and incorporating newly formed ones. Such elimination and incorporation are formalised as the operations of contraction and revision in belief change. In this paper, we deal with contraction and revision for the DL-Lite family through a model-theoretic approach. Standard description logic semant...
متن کاملContraction and Revision over DL-Lite TBoxes
Two essential tasks in managing Description Logic (DL) ontologies are eliminating problematic axioms and incorporating newly formed axioms. Such elimination and incorporation are formalised as the operations of contraction and revision in belief change. In this paper, we deal with contraction and revision for the DL-Lite family through a model-theoretic approach. Standard DL semantics yields in...
متن کامل